0.13/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.13/0.18 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.19/0.40 % Computer : n007.cluster.edu 0.19/0.40 % Model : x86_64 x86_64 0.19/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.19/0.40 % Memory : 8042.1875MB 0.19/0.40 % OS : Linux 3.10.0-693.el7.x86_64 0.19/0.40 % CPULimit : 1200 0.19/0.40 % WCLimit : 120 0.19/0.40 % DateTime : Tue Jul 13 15:41:34 EDT 2021 0.19/0.40 % CPUTime : 0.19/0.40 % Number of cores: 8 0.19/0.40 % Python version: Python 3.6.8 0.19/0.40 # Version: 2.6rc1-ho 0.19/0.42 # No SInE strategy applied 0.19/0.42 # Trying AutoSched0 for 59 seconds 59.19/59.58 # AutoSched0-Mode selected heuristic G_E___107_C18_F1_AE_Q4_CS_SP_CO_S0Y 59.19/59.58 # and selection function SelectMaxLComplexAvoidPosPred. 59.19/59.58 # 59.19/59.58 # Preprocessing time : 2.920 s 59.34/59.67 # No success with AutoSched0 59.34/59.67 # Trying AutoSched1 for 26 seconds 62.18/62.58 # AutoSched1-Mode selected heuristic G_E___207_C18_F1_SP_PI_S0Y 62.18/62.58 # and selection function SelectMaxLComplexAvoidPosPred. 62.18/62.58 # 62.18/62.58 # Preprocessing time : 2.887 s 62.18/62.58 62.18/62.58 # Proof found! 62.18/62.58 # SZS status Theorem 62.18/62.58 # SZS output start CNFRefutation 62.18/62.58 thf(fact_8_Res, axiom, ![X37:name, X169:pi, X171:pi]:(member558706512_pi_pi @ (product_Pair_pi_pi @ (res @ X37 @ (par @ X169 @ X171)) @ (par @ X169 @ (res @ X37 @ X171))) @ rel<=fresh_name_pi @ X37 @ X169), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_8_Res)). 62.18/62.58 thf(conj_0, conjecture, member558706512_pi_pi @ (product_Pair_pi_pi @ (subs @ (res @ x @ (par @ p2 @ q)) @ y @ u) @ (par @ (subs @ p2 @ y @ u) @ (subs @ (res @ x @ q) @ y @ u))) @ rel, file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 62.18/62.58 thf(fact_1__092_060open_062_060_092_060nu_062x_062Q_091y_058_058_061u_093_A_061_A_060_092_060nu_062x_062Q_091y_058_058_061u_093_092_060close_062, axiom, (subs @ (res @ x @ q) @ y @ u)=(res @ x @ (subs @ q @ y @ u)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_1__092_060open_062_060_092_060nu_062x_062Q_091y_058_058_061u_093_A_061_A_060_092_060nu_062x_062Q_091y_058_058_061u_093_092_060close_062)). 62.18/62.58 thf(fact_5__092_060open_062_060_092_060nu_062x_062_IP_H_A_092_060parallel_062_AQ_J_091y_058_058_061u_093_A_061_A_060_092_060nu_062x_062_IP_H_091y_058_058_061u_093_A_092_060parallel_062_AQ_091y_058_058_061u_093_J_092_060close_062, axiom, (subs @ (res @ x @ (par @ p2 @ q)) @ y @ u)=(res @ x @ (par @ (subs @ p2 @ y @ u) @ (subs @ q @ y @ u))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_5__092_060open_062_060_092_060nu_062x_062_IP_H_A_092_060parallel_062_AQ_J_091y_058_058_061u_093_A_061_A_060_092_060nu_062x_062_IP_H_091y_058_058_061u_093_A_092_060parallel_062_AQ_091y_058_058_061u_093_J_092_060close_062)). 62.18/62.58 thf(fact_3__092_060open_062x_A_092_060sharp_062_AP_H_091y_058_058_061u_093_092_060close_062, axiom, fresh_name_pi @ x @ (subs @ p2 @ y @ u), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_3__092_060open_062x_A_092_060sharp_062_AP_H_091y_058_058_061u_093_092_060close_062)). 62.18/62.58 thf(c_0_5, plain, ![X37:name, X169:pi, X171:pi]:(fresh_name_pi @ X37 @ X169=>member558706512_pi_pi @ (product_Pair_pi_pi @ (res @ X37 @ (par @ X169 @ X171)) @ (par @ X169 @ (res @ X37 @ X171))) @ rel), inference(fof_simplification,[status(thm)],[fact_8_Res])). 62.18/62.58 thf(c_0_6, negated_conjecture, ~member558706512_pi_pi @ (product_Pair_pi_pi @ (subs @ (res @ x @ (par @ p2 @ q)) @ y @ u) @ (par @ (subs @ p2 @ y @ u) @ (subs @ (res @ x @ q) @ y @ u))) @ rel, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 62.18/62.58 thf(c_0_7, plain, ![X3704:name, X3705:pi, X3706:pi]:(~fresh_name_pi @ X3704 @ X3705|member558706512_pi_pi @ (product_Pair_pi_pi @ (res @ X3704 @ (par @ X3705 @ X3706)) @ (par @ X3705 @ (res @ X3704 @ X3706))) @ rel), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])). 62.18/62.58 thf(c_0_8, negated_conjecture, ~member558706512_pi_pi @ (product_Pair_pi_pi @ (subs @ (res @ x @ (par @ p2 @ q)) @ y @ u) @ (par @ (subs @ p2 @ y @ u) @ (subs @ (res @ x @ q) @ y @ u))) @ rel, inference(split_conjunct,[status(thm)],[c_0_6])). 62.18/62.58 thf(c_0_9, plain, (subs @ (res @ x @ q) @ y @ u)=(res @ x @ (subs @ q @ y @ u)), inference(split_conjunct,[status(thm)],[fact_1__092_060open_062_060_092_060nu_062x_062Q_091y_058_058_061u_093_A_061_A_060_092_060nu_062x_062Q_091y_058_058_061u_093_092_060close_062])). 62.18/62.58 thf(c_0_10, plain, ![X1:name, X6:pi, X3:pi]:(member558706512_pi_pi @ (product_Pair_pi_pi @ (res @ X1 @ (par @ X3 @ X6)) @ (par @ X3 @ (res @ X1 @ X6))) @ rel|~fresh_name_pi @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_7])). 62.18/62.58 thf(c_0_11, plain, (subs @ (res @ x @ (par @ p2 @ q)) @ y @ u)=(res @ x @ (par @ (subs @ p2 @ y @ u) @ (subs @ q @ y @ u))), inference(split_conjunct,[status(thm)],[fact_5__092_060open_062_060_092_060nu_062x_062_IP_H_A_092_060parallel_062_AQ_J_091y_058_058_061u_093_A_061_A_060_092_060nu_062x_062_IP_H_091y_058_058_061u_093_A_092_060parallel_062_AQ_091y_058_058_061u_093_J_092_060close_062])). 62.18/62.58 thf(c_0_12, plain, fresh_name_pi @ x @ (subs @ p2 @ y @ u), inference(split_conjunct,[status(thm)],[fact_3__092_060open_062x_A_092_060sharp_062_AP_H_091y_058_058_061u_093_092_060close_062])). 62.18/62.58 thf(c_0_13, negated_conjecture, ~member558706512_pi_pi @ (product_Pair_pi_pi @ (subs @ (res @ x @ (par @ p2 @ q)) @ y @ u) @ (par @ (subs @ p2 @ y @ u) @ (res @ x @ (subs @ q @ y @ u)))) @ rel, inference(rw,[status(thm)],[c_0_8, c_0_9])). 62.18/62.58 thf(c_0_14, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])]), c_0_13]), ['proof']). 62.18/62.58 # SZS output end CNFRefutation 62.18/62.58 # Proof object total steps : 15 62.18/62.58 # Proof object clause steps : 7 62.18/62.58 # Proof object formula steps : 8 62.18/62.58 # Proof object conjectures : 4 62.18/62.58 # Proof object clause conjectures : 2 62.18/62.58 # Proof object formula conjectures : 2 62.18/62.58 # Proof object initial clauses used : 5 62.18/62.58 # Proof object initial formulas used : 5 62.18/62.58 # Proof object generating inferences : 1 62.18/62.58 # Proof object simplifying inferences : 4 62.18/62.58 # Training examples: 0 positive, 0 negative 62.18/62.58 # Parsed axioms : 441 62.18/62.58 # Removed by relevancy pruning/SinE : 0 62.18/62.58 # Initial clauses : 28681 62.18/62.58 # Removed in clause preprocessing : 135 62.18/62.58 # Initial clauses in saturation : 28546 62.18/62.58 # Processed clauses : 355 62.18/62.58 # ...of these trivial : 0 62.18/62.58 # ...subsumed : 52 62.18/62.58 # ...remaining for further processing : 303 62.18/62.58 # Other redundant clauses eliminated : 0 62.18/62.58 # Clauses deleted for lack of memory : 0 62.18/62.58 # Backward-subsumed : 0 62.18/62.58 # Backward-rewritten : 0 62.18/62.58 # Generated clauses : 420 62.18/62.58 # ...of the previous two non-trivial : 314 62.18/62.58 # Contextual simplify-reflections : 0 62.18/62.58 # Paramodulations : 326 62.18/62.58 # Factorizations : 0 62.18/62.58 # NegExts : 5 62.18/62.58 # Equation resolutions : 43 62.18/62.58 # Propositional unsat checks : 0 62.18/62.58 # Propositional check models : 0 62.18/62.58 # Propositional check unsatisfiable : 0 62.18/62.58 # Propositional clauses : 0 62.18/62.58 # Propositional clauses after purity: 0 62.18/62.58 # Propositional unsat core size : 0 62.18/62.58 # Propositional preprocessing time : 0.000 62.18/62.58 # Propositional encoding time : 0.000 62.18/62.58 # Propositional solver time : 0.000 62.18/62.58 # Success case prop preproc time : 0.000 62.18/62.58 # Success case prop encoding time : 0.000 62.18/62.58 # Success case prop solver time : 0.000 62.18/62.58 # Current number of processed clauses : 303 62.18/62.58 # Positive orientable unit clauses : 51 62.18/62.58 # Positive unorientable unit clauses: 0 62.18/62.58 # Negative unit clauses : 70 62.18/62.58 # Non-unit-clauses : 182 62.18/62.58 # Current number of unprocessed clauses: 28503 62.18/62.58 # ...number of literals in the above : 307221 62.18/62.58 # Current number of archived formulas : 0 62.18/62.58 # Current number of archived clauses : 0 62.18/62.58 # Clause-clause subsumption calls (NU) : 5572 62.18/62.58 # Rec. Clause-clause subsumption calls : 5153 62.18/62.58 # Non-unit clause-clause subsumptions : 49 62.18/62.58 # Unit Clause-clause subsumption calls : 1098 62.18/62.58 # Rewrite failures with RHS unbound : 0 62.18/62.58 # BW rewrite match attempts : 27 62.18/62.58 # BW rewrite match successes : 0 62.18/62.58 # Condensation attempts : 0 62.18/62.58 # Condensation successes : 0 62.18/62.58 # Termbank termtop insertions : 2891617 62.25/62.59 62.25/62.59 # ------------------------------------------------- 62.25/62.59 # User time : 60.828 s 62.25/62.59 # System time : 1.194 s 62.25/62.59 # Total time : 62.022 s 62.25/62.59 # Maximum resident set size: 2752 pages 62.25/62.59 EOF